Submodularity in Combinatorial Optimization
نویسنده
چکیده
2007 Preface This a continually updated version of my second PhD thesis, submitted to the Department of Applied Mathematics at Charles University. It serves mainly for myself as a compendium of my research on submodular optimization and related problems, Acknowledgement This thesis would not have seen the light of day without the support and perseverance of Martin Loebl, and significant assistance of several others. I would like to thank first and foremost Uriel Feige for introducing me to this subject and being a wonderful guide. I am also grateful to Chandra Chekuri for enlightening conversations and bringing my attention to one of the topics presented here. Let me not forget Gruia Calinescu, Mohammad Mahdian, Vahab Mirrokni, Benny Sudakov and others who have been very helpful in their discussions. Most of this work has been published together with some of the co-authors mentioned above; the copyright belongs to the respective periodicals.
منابع مشابه
Derandomization for k-submodular maximization
Submodularity is one of the most important property of combinatorial optimization, and k-submodularity is a generalization of submodularity. Maximization of a k-submodular function is NP-hard, and approximation algorithm has been studied. For monotone k-submodular functions, [Iwata, Tanigawa, and Yoshida 2016] gave k/(2k−1)-approximation algorithm. In this paper, we give a deterministic algorit...
متن کاملSubmodularity of some classes of the combinatorial optimization games
Submodularity (or concavity) is considered as an important property in the field of cooperative game theory. In this article, we characterize submodular minimum coloring games and submodular minimum vertex cover games. These characterizations immediately show that it can be decided in polynomial time that the minimum coloring game or the minimum vertex cover game on a given graph is submodular ...
متن کاملSubmodularity of a Set Label Disagreement Function
A set label disagreement function is defined over the number of variables that deviates from the dominant label. The dominant label is the value assumed by the largest number of variables within a set of binary variables. The submodularity of a certain family of set label disagreement function is discussed in this manuscript. Such disagreement function could be utilized as a cost function in co...
متن کاملSome Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization. Nowadays submodular functions optimization has been attracted by many researchers. Pendant pairs of a symmetric...
متن کاملCSC 5160 : Combinatorial Optimization and Approximation Algorithms
In this lecture, the focus is on submodular function in combinatorial optimizations. The first class of submodular functions which was studied thoroughly was the class of matroid rank functions. The flourishing stage of matroid theory came with Jack Edmonds’ work in 1960s, when he gave a minmax formula and an efficient algorithm to the matroid partition problem, from which the matroid intersect...
متن کاملSeveral Aspects of Antimatroids and Convex Geometries Master's Thesis
Convexity is important in several elds, and we have some theories on it. In this thesis, we discuss a kind of combinatorial convexity, in particular, antimatroids and convex geometries. An antimatroid is a combinatorial abstraction of convexity. It has some di erent origins; by Dilworth in lattice theory, by Edelman and Jamison in the notions of convexity, by Korte{Lov asz who were motivated by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007